How to draw the minimum cuts of a planar graph
نویسندگان
چکیده
We show how to utilize the cactus representation of all minimum cuts of a graph to visualize the minimum cuts of a planar graph in a planar drawing. In a first approach the cactus is transformed into a hierarchical clustering of the graph that contains complete information on all the minimum cuts. This approach is then extended to drawings in which the two vertex subsets of every minimum cut are separated by a simple closed curve. While both approaches work with any embedding-preserving drawing algorithm, we specifically discuss bend-minimum orthogonal drawings. 2004 Elsevier B.V. All rights reserved.
منابع مشابه
How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract)
We show how to utilize the cactus representation of all minimum cuts of a graph to visualize the minimum cuts of a planar graph in a planar drawing. In a first approach the cactus is transformed into a hierarchical clustering of the graph that contains complete information on all the minimum cuts. This approach is then extended to drawings in which the two vertex subsets of every minimum cut ar...
متن کاملContiguous Minimum Single-Source-Multi-Sink Cuts in Weighted Planar Graphs
We present a fast algorithm for uniform sampling of contiguous minimum cuts separating a source vertex from a set of sink vertices in a weighted undirected planar graph with n vertices embedded in the plane. The algorithm takes O(n) time per sample, after an initial O(n) preprocessing time during which the algorithm computes the number of all such contiguous minimum cuts. Contiguous cuts (that ...
متن کاملFlow equivalent trees in undirected node-edge-capacitated planar graphs
Given an edge-capacitated undirected graph G = (V ,E,C) with edge capacity c :E → R+, n = |V |, an s − t edge cut C of G is a minimal subset of edges whose removal from G will separate s from t in the resulting graph, and the capacity sum of the edges in C is the cut value of C. A minimum s − t edge cut is an s − t edge cut with the minimum cut value among all s − t edge cuts. A theorem given b...
متن کاملImproved Minimum Cuts and Maximum Flows in Undirected Planar Graphs
In this paper we study minimum cut and maximum flow problems on planar graphs, both in static and in dynamic settings. First, we present an algorithm that given an undirected planar graph computes the minimum cut between any two given vertices in O(n log logn) time. Second, we show how to achieve the same O(n log logn) bound for the problem of computing maximum flows in undirected planar graphs...
متن کاملA fast algorithm for minimum weight odd circuits and cuts in planar graphs
We give a simple O(n3/2 log n) algorithm for finding a minimum weight odd circuit in planar graphs. By geometric duality, the same algorithm can be used to find minimum weight odd cuts. For general sparse graphs, the fastest known algorithms for these two problems take O(n2 log n) time and O(n3 log n) time, respectively. © 2004 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004